An optimal solution for the budgets assignment problem

نویسندگان

چکیده

Municipalities are service organizations that have a major role in strategic planning and community development consider the future changes society developments, by implementing set of projects with pre-allocated budgets. Projects standards, budgets constraints differ from one to another city another. Fair distributing different municipalities, while ensuring provision various capabilities reach developmental is NP-Hard problem. Assuming all municipalities same characteristics. The problem as follows: given budgets, how distribute minimum budget gap between municipalities. To derive equity distribution this paper developed lower bounds eleven heuristics be utilized branch-and-bound algorithms. performance heuristics, exact solutions presented experimental study.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

A simple solution to the optimal eigenvalue assignment problem

The problem of the optimal eigenvalue assignment for multiinput linear systems is considered. It is proven that for an n-order system with m independent inputs, the problem is split into the following two sequential stages. Initially, the n m eigenvalues are assigned using an n m-order system. This assignment is not constrained to satisfy optimality criteria. Next, an m-order system is used to ...

متن کامل

A New Approach for Finding an Optimal Solution for Grey Transportation Problem

In ordinary transportation problems, it is always supposed that the mileage from every source to every destination is a definite number. But in special conditions, such as transporting emergency materials when natural calamity occurs or transporting military supplies during wartime, carrying network may be destroyed, mileage from some sources to some destinations are no longer definite. It is u...

متن کامل

Pose verification as an optimal assignment problem

Bhandarkar, S.M. and M. Suk, Pose verification as an optimal assignment problem, Pattern Recognition Letters 12 (1991) 45-53. ' In this paper we propose a feature comparison based technique for pose verification for 3-D object recognition and localization from range images. The proposed technique treats the pose verification problem as an optimal assigmnent problem and could be looked upon as a...

متن کامل

Optimal discounts for the online assignment problem

We prove that, for two simple functions drlt, solving the online assignment problem with crl − drlt as the contribution for assigning resource r to task l at time t gives the optimal solution to the corresponding offline assignment problem (provided the optimal offline solution is unique). We call such functions drlt optimal discount functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rairo-operations Research

سال: 2021

ISSN: ['1290-3868', '0399-0559']

DOI: https://doi.org/10.1051/ro/2021043